Square root relaxation: two possible mechanisms
نویسندگان
چکیده
منابع مشابه
Square root relaxation: two possible mechanisms
Magnetic relaxation in large spin molecular paramagnets is often found to behave as δM(t) ∼ √ t at short times t. This behaviour was explained by Prokofiev & Stamp as arising from dipole interactions between molecular spins. However, as observed by Miyashita & Saito, the same behaviour can arise from a different mechanism which, in the present work, is related to hyperfine interactions. The Miy...
متن کاملSquare root intensity coding in turtle cones: physiological mechanisms.
The effect of coupling on the intensity-response functions for full field and for slit stimuli was studied by comparing the shapes of the curves obtained from several strongly coupled red cones of turtle with that of one very weakly coupled cone. The full field V-log I curves could be fitted by a Michaelis-Menten relationship, regardless of the strength of the coupling. For the weakly coupled c...
متن کاملImproving Goldschmidt Division, Square Root, and Square Root Reciprocal
ÐThe aim of this paper is to accelerate division, square root, and square root reciprocal computations when the Goldschmidt method is used on a pipelined multiplier. This is done by replacing the last iteration by the addition of a correcting term that can be looked up during the early iterations. We describe several variants of the Goldschmidt algorithm, assuming 4-cycle pipelined multiplier, ...
متن کاملTwo-fold normalized square-root Schur RLS adaptive filter
SVD-based method for band limitation. In doing so, we redefined finite-extent band limitation. Our method was chosen to have the correct dimension specified by Slepian's result [ 11, to specialize correctly to the DTFT as the sample size tends to infinity, and to have maximum energy concentration. We presented an efficient method, based on the Lanczos algorithm, for performing the proposed band...
متن کاملSquare-root rule of two-dimensional bandwidth problem
The bandwidth minimization problem is of significance in network communication and related areas. Let G be a graph of n vertices. The two-dimensional bandwidth B2(G) of G is the minimum value of the maximum distance between adjacent vertices when G is embedded into an n × n grid in the plane. As a discrete optimization problem, determining B2(G) is NP-hard in general. However, exact results for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal B
سال: 2005
ISSN: 1434-6028,1434-6036
DOI: 10.1140/epjb/e2005-00396-7